The strength of chemical linkage as a criterion for pruning metabolic graphs
نویسندگان
چکیده
MOTIVATION A metabolic graph represents the connectivity patterns of a metabolic system, and provides a powerful framework within which the organization of metabolic reactions can be analyzed and elucidated. A common practice is to prune (i.e. remove nodes and edges) the metabolic graph prior to any analysis in order to eliminate confounding signals from the representation. Currently, this pruning process is carried out in an ad hoc fashion, resulting in discrepancies and ambiguities across studies. RESULTS We propose a biochemically informative criterion, the strength of chemical linkage (SCL), for a systematic pruning of metabolic graphs. By analyzing the metabolic graph of Escherichia coli, we show that thresholding SCL is powerful in selecting the conventional pathways' connectivity out of the raw network connectivity when the network is restricted to the reactions collected from these pathways. Further, we argue that the root of ambiguity in pruning metabolic graphs is in the continuity of the amount of chemical content that can be conserved in reaction transformation patterns. Finally, we demonstrate how biochemical pathways can be inferred efficiently if the search procedure is guided by SCL.
منابع مشابه
Linkage between oxygen uptake at ventilatory threshold and muscle strength in subjects with and without metabolic syndrome.
We evaluated the linkage between oxygen uptake at the ventilatory threshold (VT) and muscle strength in subjects with and without metabolic syndrome. We used data of 226 Japanese men with metabolic syndrome and 265 Japanese men without the syndrome. Metabolic syndrome has recently been defined by a new criterion in Japan. Oxygen uptake at VT and muscle strength, i.e. grip strength and leg stren...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملتأثیر فعالیت کرم ورمیکمپوست Eisenia foetida و بقایای آلی مختلف بر برخی خواص شیمیایی خاک و شاخصهای رشد گیاه ذرت
Earthworms are an important component of soil fauna because of their fundamental impact on soil physical, chemical and biological properties. To evaluate the effects of earthworms on some soil chemical properties as well as plant growth indicators, an experiment was carried out in a completely randomized design in greenhouse conditions. The first factor involved the presence or absence of earth...
متن کاملNew empirical failure criterion for shale
A new failure criterion was presented to predict the ultimate strength of shale under the triaxial and polyaxial state of stress. A database containing 93 datasets was obtained from the results of the uniaxial, triaxial, polyaxial compressive tests, an indirect tensile test was collected from reliable references, and this test was carried out on the shale samples taken from the southwestern oil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 27 14 شماره
صفحات -
تاریخ انتشار 2011